ON SOME REGULAR MULTI-VEBLEN CONFIGURATIONS, THE GEOMETRY OF COMBINATORIAL QUASI GRASSMANNIANS

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial Grassmannians

We follow the rules: k, n denote elements of N and X, Y , Z denote sets. One can prove the following propositions: (1) For all sets a, b such that a 6= b and a = n and b = n holds a ∩ b < n and n+ 1 ≤ a ∪ b. (2) For all sets a, b such that a = n+ k and b = n+ k holds a ∩ b = n iff a ∪ b = n+ 2 · k. (3) X ≤ Y iff there exists a function f such that f is one-to-one and X ⊆ dom f and f ◦X ⊆ Y. (4)...

متن کامل

On the Computational Complexity of some problems from Combinatorial Geometry

We study several canonical decision problems that arise from the most famous theorems from combinatorial geometry. We show that these are W[1]-hard (and NP-hard) if the dimension is part of the input by fpt-reductions (which are actually ptime-reductions) from the d-Sum problem. Among others, we show that computing the minimum size of a Caratheodory set and a Helly set and certain decision vers...

متن کامل

On Some Characteristic Properties of Quasi-frobenius and Regular Rings

Recently the first writer [l] gave a characterization of quasiFrobenius rings, introduced formerly by the second writer [3], in terms of a condition proposed by K. Shoda, which reads: A ring A satisfying minimum condition and possessing a unit element is a quasi-Frobenius ring if and only if A satisfies the following condition:1 (a) every (A -left-) homomorphism of a left-ideal of A into A may ...

متن کامل

The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem

This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...

متن کامل

Combinatorial Models for the Finite-Dimensional Grassmannians

Let Mn be a linear hyperplane arrangement in IR. We define finite posets Gk(M) and Vk(M) of oriented matroids associated with this, which approximate the Grassmannian Gk(IR) and the Stiefel manifold Vk(IR), respectively. The basic conjectures are that the “OM-Grassmannian” Gk(M) has the homotopy type of Gk(IR), and that the “OM-Stiefel bundle” ∆π : ∆Vk(M) −→ ∆Gk(M) is a surjective map. These co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Demonstratio Mathematica

سال: 2009

ISSN: 2391-4661

DOI: 10.1515/dema-2009-0216